Eigenvector-based identification of bipartite subgraphs
نویسندگان
چکیده
منابع مشابه
Bipartite Subgraphs
It is shown that there exists a positive c so that for any large integer m, any graph with 2m 2 edges contains a bipartite subgraph with at least m 2 + m/2 + c √ m edges. This is tight up to the constant c and settles a problem of Erd˝ os. It is also proved that any triangle-free graph with e > 1 edges contains a bipartite subgraph with at least e 2 + c e 4/5 edges for some absolute positive co...
متن کاملFinding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems: • given a graph with n vertices and m edges, where m ≥ 3n3/2, find a complete balanced bipartite subgraph with parts about lnn ln(n/m) , • given a graph with n vertices, find a decomposition of its edges into complete balanced bipartite graphs having altogether O(n2/ lnn) vertices. Previous proofs of the existence of such objects, ...
متن کاملoptimal orientations of subgraphs of complete bipartite graphs
for a graph g, let d(g) be the set of all strong orientations of g. the orientationnumber of g is min {d(d) |d belongs to d(g)}, where d(d) denotes the diameterof the digraph d. in this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.
متن کاملEdge cover by bipartite subgraphs
k≤m Ek and m is minimum. Two related and reasonably well-studied problems are the Minimum Biclique Cover (MBC), where Hk are required to be bicliques (i.e. complete bipartite subgraphs) [4,3,2,1] and the Minimum Cut Cover (MCC), where Hk are cutsets, namely not required to be connected. Both problems are NP-hard. To the best of our knowledge, whether the MBGC is NP-hard or not is currently unkn...
متن کاملDominating Bipartite Subgraphs in Graphs
A graph G is hereditarily dominated by a class D of connected graphs if each connected induced subgraph of G contains a dominating induced subgraph belonging to D. In this paper we characterize graphs hereditarily dominated by classes of complete bipartite graphs, stars, connected bipartite graphs, and complete k-partite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.03.028